Similarity Assessment and Retrieval of Generalized Cases
نویسندگان
چکیده
This paper addresses the similarity assessment and the retrieval problems in Case-Based Reasoning for case bases consisting of traditional and generalized cases. Previous work focussed on similarity assessment for generalized cases with continuous domains. The similarity assessment problem was formulated as Nonlinear Programm (NLP), which is well known in mathematical optimization. In several real world applications (e.g. in our project) generalized cases have mixed discrete and continuous domains. This paper provides a formulation of similarity assessment problem for such generalized cases as a Mixed Integer Nonlinear Optimization Programm (MINLP). Furthermore this paper proposes two different index-based methods solving the retrieval problem.
منابع مشابه
Reasoning with Generalized Cases
Similarity-based retrieval of stored objects is one of the main building blocks of a case-based reasoning approach (CBR). Over the last three decades several sophisticated retrieval methods have been developed which are more suitable for many real-world scenarios than the traditional database search. However, the CBR approach and in particular the published retrieval methods do not support suff...
متن کاملImproving KD-Tree Based Retrieval for Attribute Dependent Generalized Cases
Generalized cases are cases that cover a subspace rather than a point in the problem-solution space. Attribute dependent generalized cases are a subclass of generalized cases, which cause a high computational complexity during similarity assessment. We present a new approach for an efficient indexbased retrieval of such generalized cases by an improved kdtree approach. The experimental evaluati...
متن کاملMINLP Based Retrieval of Generalized Cases
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, ...
متن کاملApproximative Retrieval of Attribute Dependent Generalized Cases
In our current research project about electronic designs the problem to retrieve attribute dependent generalized cases occurs. This kind of cases cover an arbitrary subspace rather than a point in the space, spanned by the cases attributes and by a set of constraints. For such representations, the similarity assessment between a point query and generalized cases is a difficult problem for which...
متن کاملCombining Strict Matching and Similarity Assessment for Retrieving Appropriate Cases Efficiently
It is essential for case-based reasoning (CBR) systems to access trnly relevant cases efficiently. Similarity assessment adopted by many CBR systems needs performance improvement, especially if the case library of a CBR system consists of a database in the target domain which is not equipped with suitable indexing for the CBR system. In consideration of this problem, we are exploring use of str...
متن کامل